Boxicity and maximum degree
نویسندگان
چکیده
An axis-parallel d–dimensional box is a Cartesian product R1 × R2 × · · · × Rd where Ri (for 1 ≤ i ≤ d) is a closed interval of the form [ai, bi] on the real line. For a graph G, its boxicity box(G) is the minimum dimension d, such that G is representable as the intersection graph of (axis–parallel) boxes in d–dimensional space. The concept of boxicity finds applications in various areas such as ecology, operation research etc. We show that for any graph G with maximum degree ∆, box(G) ≤ 2∆ + 2. That the bound does not depend on the number of vertices is a bit surprising considering the fact that there are highly connected bounded degree graphs such as expander graphs. Our proof is very short and constructive. We conjecture that box(G) is O(∆). Let F = {Sx ⊆ U : x ∈ V } be a family of subsets of a universe U , where V is an index set. The intersection graph Ω(F) of F has V as vertex set, and two distinct vertices x and y are adjacent if and only if Sx ∩ Sy 6= ∅. Representation of graphs as the intersection graphs of various geometrical objects is a well studied topic in graph theory. A prime example of a graph class defined in this way is the class of interval graphs: A graph G is an interval graph if and only if G has an interval realization: i.e., each vertex of G can be associated to an interval on the real line such that two intervals intersect if and only if the corresponding vertices are adjacent. Motivated by theoretical as well as practical considerations, graph theorists have tried to generalize the concept of interval graphs in various ways. One such generalization is the concept of boxicity defined as follows. An axis-parallel d–dimensional box is a Cartesian product R1 × R2 × · · · × Rd where Ri (for 1 ≤ i ≤ d) is a closed interval of the form [ai, bi] on the real line. For a graph G, its boxicity box(G) is the minimum dimension d, such that G is representable as the intersection graph of (axis–parallel) boxes in d–dimensional space. It is easy to see that the class of graphs with d ≤ 1 is exactly the class of Preprint submitted to Elsevier Science
منابع مشابه
Geometric Representation of Graphs in Low Dimension
An axis-parallel k–dimensional box is a Cartesian product R1 × R2 × · · · × Rk where Ri (for 1 ≤ i ≤ k) is a closed interval of the form [ai, bi] on the real line. For a graph G, its boxicity box(G) is the minimum dimension k, such that G is representable as the intersection graph of (axis–parallel) boxes in k–dimensional space. The concept of boxicity finds applications in various areas such a...
متن کاملBoxicity of graphs with bounded degree
The boxicity of a graph G = (V,E) is the smallest k for which there exist k interval graphs Gi = (V,Ei), 1 ≤ i ≤ k, such that E = E1 ∩ . . . ∩ Ek. Graphs with boxicity at most d are exactly the intersection graphs of (axis-parallel) boxes in Rd. In this note, we prove that graphs with maximum degree ∆ have boxicity at most ∆2 + 2, which improves the previous bound of 2∆2 obtained by Chandran et...
متن کاملBoxicity of Circular Arc Graphs
A k-dimensional box is the cartesian product R1 ×R2 × · · · ×Rk where each Ri is a closed interval on the real line. The boxicity of a graph G, denoted as box(G), is the minimum integer k such that G can be represented as the intersection graph of a collection of k-dimensional boxes: that is two vertices are adjacent if and only if their corresponding boxes intersect. A circular arc graph is a ...
متن کاملBoxicity of line graphs
Boxicity of a graph H , denoted by box(H), is the minimum integer k such that H is an intersection graph of axis-parallel kdimensional boxes in R. In this paper, we show that for a line graph G of a multigraph, box(G) ≤ 2∆(⌈log 2 log 2 ∆⌉ + 3) + 1, where ∆ denotes the maximum degree of G. Since ∆ ≤ 2(χ−1), for any line graph G with chromatic number χ, box(G) = O(χ log 2 log 2 (χ)). For the d-di...
متن کاملLower bounds for boxicity
An axis-parallel b-dimensional box is a Cartesian product R1×R2×· · ·×Rb where Ri is a closed interval of the form [ai, bi] on the real line. For a graph G, its boxicity box(G) is the minimum dimension b, such that G is representable as the intersection graph of boxes in b-dimensional space. Although boxicity was introduced in 1969 and studied extensively, there are no significant results on lo...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- J. Comb. Theory, Ser. B
دوره 98 شماره
صفحات -
تاریخ انتشار 2008